tree grammar

См. также в других словарях:

• Regular tree grammar — In Computer Science, a regular tree grammar is a formal grammar that allows to generate trees.DefinitionA regular tree grammar G is defined by the tuple:G = (N, Sigma, Z, P), where * N is a set of non terminals, * Sigma is a ranked alphabet (i.e …   Wikipedia

• Tree-adjoining grammar — (TAG) is a grammar formalism defined by Aravind Joshi. Tree adjoining grammars are somewhat similar to context free grammars, but the elementary unit of rewriting is the tree rather than the symbol. Whereas context free grammars have rules for… …   Wikipedia

• Tree Adjoining Grammar — Tree adjoining grammars (TAG) sind Grammatiken, die von Aravind Joshi eingeführt wurden und in der Computerlinguistik und bei der Verarbeitung von natürlichen Sprachen verwendet werden. TAGs ähneln kontextfreien Grammatiken, verwenden aber einen… …   Deutsch Wikipedia

• Grammar induction — Grammatical induction, also known as grammatical inference or syntactic pattern recognition, refers to the process in machine learning of inducing a formal grammar (usually in the form of re write rules or productions ) from a set of observations …   Wikipedia

• Grammar framework — In theoretical linguistics, the following fundamental approaches towards constructing grammar frameworks for natural languages are distinguished:*Generative grammar: algorithmic (phrase structure grammars) **Transformational grammar (1960s)… …   Wikipedia

• grammar — I (New American Roget s College Thesaurus) Mode of speaking and writing Nouns 1. grammar; accidence, syntax, analysis, synopsis, praxis, punctuation, syllabi[fi]cation; agreement. See speech, language, writing. 2. a. part of speech; participle;… …   English dictionary for students

• Tree model — Austro Asiatic Language Tree Maya Lan …   Wikipedia

• Parser Grammar Engine — The Parser Grammar Engine (originally Parrot Grammar Engine) or PGE is a compiler and runtime for a Perl 6 rules for the Parrot virtual machine. [cite web | url=http://search.cpan.org/ ltoetsch/parrot 0.2.2/compilers/pge/README | title=Parrot… …   Wikipedia

• Parser Grammar Engine — Moteur d analyse de grammaire Pour les articles homonymes, voir PGE. Le Parser Grammar Engine (PGE ou en français, moteur d analyse de grammaire) est un compilateur et un moteur d exécution pour les regex Perl 6 pour la machine virtuelle… …   Wikipédia en Français

• Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… …   Wikipedia

• Generative grammar — In theoretical linguistics, generative grammar refers to a particular approach to the study of syntax. A generative grammar of a language attempts to give a set of rules that will correctly predict which combinations of words will form… …   Wikipedia